A First-Order Logic Davis-Putnam-Logemann-Loveland Procedure

Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: a large deviation Analysis Of The . . .

Semantically-guided goal-sensitive theorem proving

We present a new inference system for first-order logic, named SGGS, which stands for semantically-guided goal-sensitive theorem proving. SGGS generalizes the model-based reasoning of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Starting from an initial interpretation, which makes it semantically guided, SGGS uses a sequence of constrained clauses to represent a current model, instance ...

Abstract Answer Set Solvers

Answer Set Solvers Yuliya Lierler University of Texas at Austin [email protected] Abstract Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, an...

FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure

FDPLL is a directly lifted version of the well-known DavisPutnam-Logeman-Loveland (DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and complementary literals, FDPLL uses a lifted splitting rule, i.e. the case analysis is made wrt. non-ground and complementary literals now. The motivation for this lifting is to bring together successful first-order techniqu...

XOR Satisfiability Solver Module for DPLL Integration

Satisfiability solvers that are based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm operate on propositional logic formulas in conjunctive normal form (CNF). Despite major improvements in solver technology, using only CNF does not seem to scale well for problem instances involving XOR expressions. We present a decision procedure to determine effectively the satisfiability of XOR clause...